A reformulation of Hilbert’s tenth problem through Quantum Mechanics
نویسنده
چکیده
Inspired by Quantum Mechanics, we reformulate Hilbert’s tenth problem in the domain of integer arithmetics into either a problem involving a set of infinitely coupled differential equations or a problem involving a Shrödinger propagator with some appropriate kernel. Either way, Mathematics and Physics could be combined for Hilbert’s tenth problem and for the notion of effective computability.
منابع مشابه
A reformulation of the Hilbert’s tenth problem through Quantum Mechanics
Inspired by Quantum Mechanics, we reformulate the Hilbert’s tenth problem in the domain of integer arithmetics into a problem involving a set of coupled differential equations. Analytical and numerical studies of the differential equations will either themselves settle and/or be of crucial assistance for some physical implementation of an adiabatic quantum algorithm to determine the existence o...
متن کاملQuantum Algorithm for the Hilbert’s Tenth Problem
We propose a quantum algorithm for the classically non-computable Hilbert’s tenth problem, which ultimately links to the Turing halting problem. Quantum continuous variables and quantum adiabatic evolution are employed for an implementation. Also discussed are a method for the time estimation for the adiabatic evolution, and a comparison with more the well-known quantum computation employing a ...
متن کاملHypercomputation with quantum adiabatic processes
Despite the recursive non-computability of Hilbert’s tenth problem, we outline and argue for a quantum algorithm that is based on the Quantum Adiabatic Theorem. It is explained how this algorithm can solve Hilbert’s tenth problem. The algorithm is then considered in the context of several “no-go” arguments against such hypercomputation. Logical arguments are usually based on Cantor’s diagonal t...
متن کاملQuantum Algorithms for the Hilbert’s Tenth Problem
Computation based on the principles of Quantum Mechanics [1] has been shown to offer better performances over classical computation, ranging from the square-root improvement in an unstructured search [2] to the exponential gain in the factorisation of integers [3]. However superior in reducing the complexity of hard computation, these quantum algorithms and all the others discovered so far are ...
متن کاملHilbert's Incompleteness, Chaitin's Ω Number and Quantum Physics
To explore the limitation of a class of quantum algorithms originally proposed for the Hilbert’s tenth problem, we consider two further classes of mathematically nondecidable problems, those of a modified version of the Hilbert’s tenth problem and of the computation of the Chaitin’s Ω number, which is a representation of the Gödel’s Incompletness theorem. Some interesting connection to Quantum ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001